A GRASP for the Biquadratic Assignment Problem
ثبت نشده
چکیده
routines for approximate solution of dense quadratic assignment problems A greedy randomized adaptive search procedure for the quadratic assignment problem, in Quadratic assign-for approximate solution of sparse quadratic assignment problems using
منابع مشابه
A GRASP for the biquadratic assignment problem
The biquadratic assignment problem BiQAP is a generalization of the quadratic assignment problem QAP It is a nonlinear integer program ming problem where the objective function is a fourth degree multivariable polynomial and the feasible domain is the assignment polytope BiQAP problems appear in VLSI synthesis Due to the di culty of this problem only heuristic solution approaches have been prop...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملHeuristics for Biquadratic Assignment Problems and Their Computational Comparison Heuristics for Biquadratic Assignment Problems and Their Computational Comparison
The biquadratic assignment problem (BiQAP) is a generalization of the quadratic assignment problem (QAP). As for any hard optimization problem also for BiQAP, a reasonable eeort to cope with the problem is trying to derive heuristics which solve it suboptimally and which, possibly, yield a good trade oo between the solution quality and the time and memory requirements. In this paper we describe...
متن کاملA Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem
A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a GRASP for the quadratic assignment problem. We review basic concepts of GRASP: construction and local search algorithms. The implementation of GRASP for the quadratic ...
متن کاملA GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem
In this talk a greedy randomized adaptive search procedure (GRASP) is presented for computing approximate solutions to the NP-hard three-index assignment problem (AP3). A FORTRAN implementation of this GRASP is tested on several problem instances of the AP3. A parallelization strategy that combines GRASP and path relinking is also proposed and tested for the problem. Computational results indic...
متن کامل